Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
نویسندگان
چکیده
We prove necessary and sufficient conditions for locally Lipschitz Löwner operators to be monotone, strictly monotone and strongly monotone. Utilizing our characterization of the strict monotonicity of Löwner operators, we generalize Mangasarian class of Nonlinear Complementarity Problem (NCP)-functions to the setting of symmetric cone complementarity problem. This affirmatively answers a question of Tseng [Math. Program. 83, 159-185(1998)].
منابع مشابه
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کامل2010 Workshop on Nonlinear Analysis and Optimization Schedule of Programs Place : M210, Mathematics Building Stationary Point Conditions for the Fb Merit Function Associated with Symmetric Cones Convergence Rate Analysis on Interval-type Algorithms for Generalized Fractional Programming
For the symmetric cone complementarity problem, we show that each stationary point of the unconstrained minimization reformulation based on the FischerBurmeister merit function is a solution to the problem, provided that the gradient operators of the mappings involved in the problem satisfy column monotonicity or have the Cartesian P0-property. These results answer the open question proposed in...
متن کاملStationary point conditions for the FB merit function associated with symmetric cones
For the symmetric cone complementarity problem, we show that each stationary point of the unconstrained minimization reformulation based on the FischerBurmeister merit function is a solution to the problem, provided that the gradient operators of the mappings involved in the problem satisfy column monotonicity or have the Cartesian P0-property. These results answer the open question proposed in...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 133 شماره
صفحات -
تاریخ انتشار 2012